منابع مشابه
Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances
This paper is the continuation of the paper “Autour de nouvelles notions pour l’analyse des algorithmes d’approximation: Formalisme unifié et classes d’approximation” where a new formalism for polynomial approximation and its basic tools allowing an “absolute” (individual) evaluation the approximability properties of NPhard problems have been presented and discussed. In order to be used for exh...
متن کاملAutour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation
The main objective of the polynomial approximation is the development of polynomial time algorithms for NP-hard problems, these algorithms guaranteeing feasible solutions lying “as near as possible” to the optimal ones. This work is the fist part of a couple of papers where we introduce the key-concepts of the polynomial approximation and present the main lines of a new formalism. Our purposes ...
متن کاملLa Médecine des lumières: tout autour de Tissot
any formal qualifications prior to the demonstration with ether is also confirmed. Interweaving the traditional story with his new information, Wolfe leads the reader through a very different tale of the introduction of ether by a man not conditioned by scientific training and lacking in moral principles. The notion is raised that it was Charles T Jackson who put the idea for the use of ether i...
متن کاملCombinatoire autour des mots sturmiens
We state some new properties on sturmian words and classify words which have, for any non-zero integer n, exactly n+2 subwords of length n. We also introduce notion of insertion k by k on in nite words and we give the complexity function's formula of words got by applying the insertion on sturmian words.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Laval théologique et philosophique
سال: 2006
ISSN: 1703-8804,0023-9054
DOI: 10.7202/013571ar